Resonance Graphs and a Binary Coding of Perfect Matchings of Outerplane Bipartite Graphs
نویسندگان
چکیده
The aim of this paper is to investigate resonance graphs 2- connected outerplane bipartite graphs, which include various families molecular graphs. Firstly, we present an algorithm for a binary coding perfect matchings these Further, with isomorphic are considered. In particular, it shown that if two evenly homeomorphic, then its isomorphic. Moreover, prove any 2-connected graph G there exists catacondensed even ring systems H such the and We conclude characterization whose daisy cubes.
منابع مشابه
Bipartite Graphs and Perfect Matchings
When we think about markets creating opportunities for interaction between buyers and sellers, there is an implicit network encoding the access between buyers and sellers. In fact, there are several ways to use networks to model buyer-seller interaction, and here we discuss some of them. First, consider the case in which not all buyers have access to all sellers. There could be several reasons ...
متن کاملThe Rotation Graphs of Perfect Matchings of Plane Bipartite Graphs
In the present paper, the minimal proper alternating cycle (MPAC) rotation graph R(G) of perfect matchings of a plane bipartite graph G is defined. We show that an MPAC rotation graph R(G) of G is a directed rooted tree, and thus extend such a result for generalized polyhex graphs to arbitrary plane bipartite graphs. As an immediate result, we describe a one-to-one correspondence between MPAC s...
متن کاملPerfect Matchings in Edge-Transitive Graphs
We find recursive formulae for the number of perfect matchings in a graph G by splitting G into subgraphs H and Q. We use these formulas to count perfect matching of P hypercube Qn. We also apply our formulas to prove that the number of perfect matching in an edge-transitive graph is , where denotes the number of perfect matchings in G, is the graph constructed from by deleting edges with an en...
متن کاملResonance Graphs and Perfect Matchings of Graphs on Surfaces
Let G be a graph embedded in a surface and let F be a set of even faces of G (faces bounded by a cycle of even length). The resonance graph of G with respect to F, denoted by R(G;F), is a graph such that its vertex set is the set of all perfect matchings of G and two vertices M1 and M2 are adjacent to each other if and only if the symmetric difference M1 ⊕M2 is a cycle bounding some face in F. ...
متن کاملPerfect matchings and ears in elementary bipartite graphs
We give lower and upper bounds for the number of reducible ears as well as upper bounds for the number of perfect matchings in an elementary bipartite graph. An application to chemical graphs is also discussed. In addition, a method to construct all minimal elementary bipartite graphs is described.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Match
سال: 2023
ISSN: ['0340-6253']
DOI: https://doi.org/10.46793/match.90-2.453b